| 翻訳と辞書 |
| Bender–Knuth involution ： ウィキペディア英語版 |
Bender–Knuth involution
In algebraic combinatorics, a Bender–Knuth involution is an involution on the set of semistandard tableaux, introduced by in their study of plane partitions.
==Definition==
The Bender–Knuth involutions σ''k'' are defined for integers ''k'', and act on the set of semistandard skew Young tableaux of some fixed shape μ/ν, where μ and ν are partitions. It acts by changing some of the elements ''k'' of the tableau to ''k'' + 1, and some of the entries ''k'' + 1 to ''k'', in such a way that the numbers of elements with values ''k'' or ''k'' + 1 are exchanged. Call an entry of the tableau free if it is ''k'' or ''k'' + 1 and there is no other element with value ''k'' or ''k'' + 1 in the same column. For any ''i'', the free entries of row ''i'' are all in consecutive columns, and consist of ''a''''i'' copies of ''k'' followed by ''b''''i'' copies of ''k'' + 1, for some ''a''''i'' and ''b''''i''. The Bender–Knuth involution σ''k'' replaces them by
''b''''i'' copies of ''k'' followed by ''a''''i'' copies of ''k'' + 1.
抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』
■ウィキペディアで「Bender–Knuth involution」の詳細全文を読む
スポンサード リンク
| 翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|